Abstract:

A universal mathematical model for path selection to minimize preemption is established. The objective function for minimizing preemption cost is given. And a new method based on the selected path to minimize preemption is proposed. It lets, in priority, the label switched paths（LSPs） share more segments of links with the selected path and, in selecting LSPs to be preempted, also cross through the whole network with fewer segments of links so that the overall preemption cost is less. Simulations show that the proposed can gain less preemption cost along the given path than in only considering single segment of link, it can approximate the optimization of the objective function for minimizing preemption cost simultaneously. It has much less computational complexity and is easier to be implemented by router as well.

Key words: